Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 104 results
Sort by: relevance publication year

Abelian Cayley Graphs of Given Degree and Diameter 2 and 3

JOURNAL ARTICLE published November 2014 in Graphs and Combinatorics

Authors: Tomáš Vetrík

Large Rainbow Matchings in Edge-Colored Graphs with Given Average Color Degree

JOURNAL ARTICLE published October 2022 in Graphs and Combinatorics

Research funded by National Natural Science Foundation of China (11871311,12071260)

Authors: Wenling Zhou

Non-orientable Regular Maps of a Given Type over Linear Fractional Groups

JOURNAL ARTICLE published July 2010 in Graphs and Combinatorics

Authors: Jozef Širáň

Two Paths Joining Given Vertices in 2k-Edge-Connected Graphs

JOURNAL ARTICLE published December 2005 in Graphs and Combinatorics

Authors: Haruko Okamura

Diameter

BOOK CHAPTER published 31 March 2024 in Polytopes and Graphs

Finding Large p-Colored Diameter Two Subgraphs

JOURNAL ARTICLE published March 1999 in Graphs and Combinatorics

Authors: Paul Erdo˝s | Tom Fowler

Dominating Sets Inducing Large Component in Graphs with Minimum Degree Two

JOURNAL ARTICLE published October 2023 in Graphs and Combinatorics

Research funded by National Natural Science Foundation of China (12061073)

Authors: Wei Yang | Baoyindureng Wu

Domination in Graphs of Minimum Degree at least Two and Large Girth

JOURNAL ARTICLE published February 2008 in Graphs and Combinatorics

Authors: Christian Löwenstein | Dieter Rautenbach

The Largest Graphs with Given Order and Diameter: A Simple Proof

JOURNAL ARTICLE published November 2019 in Graphs and Combinatorics

Research funded by National Natural Science Foundation of China-Yunnan Joint Fund (11671148,11771148) | STCSM (18dz2271000)

Authors: Pu Qiao | Xingzhi Zhan

A Note on Moore Cayley Digraphs

JOURNAL ARTICLE published September 2021 in Graphs and Combinatorics

Research funded by National Research Foundation of Korea (2018R1D1A1B07047427)

Authors: Alexander L. Gavrilyuk | Mitsugu Hirasaka | Vladislav Kabanov

A Simple Proof of Ore’s Theorem on the Maximum Size of k-connected Graphs with Given Order and Diameter

JOURNAL ARTICLE published April 2023 in Graphs and Combinatorics

Research funded by NSFC (11671148) | Science and Technology Innovation Plan Of Shanghai Science and Technology Commission (8dz2271000)

Authors: Leilei Zhang

The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number

JOURNAL ARTICLE published February 2024 in Graphs and Combinatorics

Research funded by National Research Foundation (118521)

Authors: Peter Dankelmann | Jane Morgan | Emily Rivett-Carnac

Degree Distance of Unicyclic Graphs with Given Matching Number

JOURNAL ARTICLE published May 2013 in Graphs and Combinatorics

Authors: Lihua Feng | Weijun Liu | Aleksandar Ilić | Guihai Yu

On the Degree Distance of Unicyclic Graphs with Given Matching Number

JOURNAL ARTICLE published November 2015 in Graphs and Combinatorics

Authors: Shuchao Li | Yibing Song | Huihui Zhang

Triangulations on Closed Surfaces Covered by Vertices of Given Degree

JOURNAL ARTICLE published 1 September 2001 in Graphs and Combinatorics

Authors: Seiya Negami | Atsuhiro Nakamoto

Graphs with Diameter 2 and Large Total Domination Number

JOURNAL ARTICLE published January 2021 in Graphs and Combinatorics

Authors: Artūras Dubickas

A Characterization of Domination Weak Bicritical Graphs with Large Diameter

JOURNAL ARTICLE published September 2018 in Graphs and Combinatorics

Authors: Michitaka Furuya

Extremal Values of the Chromatic Number for a Given Degree Sequence

JOURNAL ARTICLE published July 2017 in Graphs and Combinatorics

Authors: Stéphane Bessy | Dieter Rautenbach

Infinite Series of Triangulations on Closed Surfaces with Vertex Covers of Given Degree

JOURNAL ARTICLE published 1 March 2004 in Graphs and Combinatorics

Authors: Tetsuji Katahira

Elementary strong maps of graphic matroids

JOURNAL ARTICLE published December 1987 in Graphs and Combinatorics

Authors: András Recski